Selection of optimal dimensionality reduction method using chernoff bound for segmental unit input HMM
نویسندگان
چکیده
To precisely model the time dependency of features, segmental unit input HMM with a dimensionality reduction method has been widely used for speech recognition. Linear discriminant analysis (LDA) and heteroscedastic discriminant analysis (HDA) are popular approaches to reduce the dimensionality. We have proposed another dimensionality reduction method called power linear discriminant analysis (PLDA) to select the best dimensionality reduction method that yields the highest recognition performance. This selection process on the basis of trial and error requires much time to train HMMs and to test the recognition performance for each dimensionality reduction method. In this paper we propose a performance comparison method without training or testing. We show that the proposed method using the Chernoff bound can rapidly and accurately evaluate the relative recognition performance.
منابع مشابه
Improving Chernoff criterion for classification by using the filled function
Linear discriminant analysis is a well-known matrix-based dimensionality reduction method. It is a supervised feature extraction method used in two-class classification problems. However, it is incapable of dealing with data in which classes have unequal covariance matrices. Taking this issue, the Chernoff distance is an appropriate criterion to measure distances between distributions. In the p...
متن کاملTopological and Algebraic Properties of Chernoff Information between Gaussian Graphs
In this paper, we want to find out the determiningfactors of Chernoff information in distinguishing a set of Gaus-sian graphs. We find that Chernoff information of two Gaussiangraphs can be determined by the generalized eigenvalues of theircovariance matrices. We find that the unit generalized eigenvaluedoesn’t affect Chernoff information and its corresponding di-mension...
متن کاملLinear Discriminant Analysis Using a Generalized Mean of Class Covariances and Its Application to Speech Recognition
To precisely model the time dependency of features is one of the important issues for speech recognition. Segmental unit input HMM with a dimensionality reduction method has been widely used to address this issue. Linear discriminant analysis (LDA) and heteroscedastic extensions, e.g., heteroscedastic linear discriminant analysis (HLDA) or heteroscedastic discriminant analysis (HDA), are popula...
متن کاملFeature Transformation Based on Generalization of Linear Discriminant Analysis
Hidden Markov models (HMMs) have been widely used to model speech signals for speech recognition. However, they cannot precisely model the time dependency of feature parameters. In order to overcome this limitation, several researchers have proposed extensions, such as segmental unit input HMM (Nakagawa & Yamamoto, 1996). Segmental unit input HMM has been widely used for its effectiveness and t...
متن کاملPseudorandomness for concentration bounds and signed majorities
The problem of constructing pseudorandom generators that fool halfspaces has been studied intensively in recent times. For fooling halfspaces over {±1}n with polynomially small error, the best construction known requires seed-length O(log(n)) [MZ13]. Getting the seed-length down to O(log(n)) is a natural challenge in its own right, which needs to be overcome in order to derandomize RL. In this ...
متن کامل